Collection Path Ant Colony Optimization for Multi - agent Static Task Allocation ?
نویسندگان
چکیده
Mutual cooperation in Multi-Agent Systems is an important means to implement complex applications. The static task allocation is one of the key issues in agent cooperation mechanism. The latency of the network infrastructure, dynamic topology and node heterogeneity are important features of the agent system, and they bring new challenges to the static task allocation in multi-agent environment. Based on the traditional parallel computing task allocation method and Ant Colony Optimization algorithm, this paper proposes Collection Path Ant Colony Optimization, trying to find the globally optimal task allocation, and reduce the time complexity. We modify the heuristic function and the update strategy in the Ant-Cycle Model; establish three-dimensional path pheromone storage space. The experimental results on a multi-agent static task allocation show that CPACO is effective in system performance and reliability.
منابع مشابه
Multiple-Agent Task Allocation Algorithm Utilizing Ant Colony Optimization
Task allocation in multiple agent system has been widely applied many application fields, such as unmanned aerial vehicle, multi-robot system and manufacturing system et al. Therefore, it becomes one of the hot topics in distributed artificial intelligence research field for several years. Therefore, in this paper, we propose a novel task allocation algorithm in multiple agent systems utilizing...
متن کاملA Non-dominated Sorting Ant Colony Optimization Algorithm Approach to the Bi-objective Multi-vehicle Allocation of Customers to Distribution Centers
Distribution centers (DCs) play important role in maintaining the uninterrupted flow of goods and materials between the manufacturers and their customers.This paper proposes a mathematical model as the bi-objective capacitated multi-vehicle allocation of customers to distribution centers. An evolutionary algorithm named non-dominated sorting ant colony optimization (NSACO) is used as the optimi...
متن کاملOn Integrated Ant Colony Optimization Strategies for Improved Channel Allocation in Large Scale Wireless Communications
Recently, various sophisticated strategies adapted to current network conditions have been proposed for channel allocation based on intelligent techniques such as evolutionary and genetic algorithms. These approaches constitute heuristic solutions to resource management problems in modern cellular systems. On the other hand, the ant colony optimization approach has been proposed for solving sev...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملAnt Colony Optimization for Multi-objective Digital Convergent Product Network
Convergent product is an assembly shape concept integrating functions and sub-functions to form a final product. To conceptualize the convergent product problem, a web-based network is considered in which a collection of base functions and sub-functions configure the nodes and each arc in the network is considered to be a link between two nodes. The aim is to find an optimal tree of functionali...
متن کامل